On solving multi-objective bin packing problems using memetic algorithms
نویسندگان
چکیده
The bin-packing problem (BPP) and its multi-dimensional variants have many practical applications, such as packing objects in boxes, production planning, multiprocessor scheduling, etc. The classical singleobjective formulation of the two-dimensional bin packing (2D-BPP) consists of packing a set of objects (pieces) in the minimum number of bins (containers). This paper presents a new Pareto-based multiobjective memetic algorithm that, in addition to the number of bins used, also minimizes the imbalance of the bins. Results obtained show the good performance of this meta-heuristic when using specific operators.
منابع مشابه
One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm
Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In t...
متن کامل1 0 O ct 2 01 2 Comparing several heuristics for a packing problem
Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The current paper is comparing a greedy algor...
متن کاملComparing several heuristics for a packing problem
Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a minimum size rectangular bin, without overlapping. The restriction is that the items cannot be rotated. The current paper is comparing a greedy algor...
متن کاملParallel Hyperheuristics for a MultiObjectivised 2D Packing Problem
Bin Packing Problems are combinatorial NP-hard problems in which objects with different shapes must be packed into a finite number of bins. They have many practical applications as filling up containers. In this work, the 2D Bin Packing Problem (2DPP) proposed in the Genetic and Evolutionary Computation Conference 2008 has been considered. The best results for the 2DPP contest instance were obt...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کامل